Mitigating backdoor attacks in LSTM-based text classification systems by Backdoor Keyword Identification
نویسندگان
چکیده
It has been proved that deep neural networks are facing a new threat called backdoor attacks, where the adversary can inject backdoors into network model through poisoning training dataset. When input containing some special pattern trigger, with will carry out malicious task such as misclassification specified by adversaries. In text classification systems, inserted in models cause spam or speech to escape detection. Previous work mainly focused on defense of attacks computer vision, little attention paid method for RNN regarding classification. this paper, analyzing changes inner LSTM neurons, we proposed Backdoor Keyword Identification (BKI) mitigate which performs against LSTM-based data poisoning. This identify and exclude samples crafted insert from without verified trusted We evaluate our four different datset: IMDB, DBpedia ontology, 20 newsgroups Reuters-21578 all achieves good performance regardless trigger sentences.
منابع مشابه
Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoning
Deep learning models have achieved high performance on many tasks, and thus have been applied to many security-critical scenarios. For example, deep learning-based face recognition systems have been used to authenticate users to access many security-sensitive applications like payment apps. Such usages of deep learning systems provide the adversaries with sufficient incentives to perform attack...
متن کاملBackdoor Trees
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain “hidden structure” in real-world instances. We introduce the notion of backdoor trees as an indicator for the presence of a hidden structure. Backdoor trees refine the notion of strong backdoor sets, taking into account the relationship between backdoor variables. We prese...
متن کاملBackdoor Branching
We present an exact Mixed Integer Programming (MIP) solution scheme where a set covering model is used to find a small set of first-choice branching variables. In a preliminary “sampling” phase, our method quickly collects a number of relevant lowcost fractional solutions that qualify as obstacles for the Linear Programming (LP) relaxation bound improvement. Then a set covering model is solved ...
متن کاملFrom Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets
Identifying and exploiting hidden problem structures is recognized as a fundamental way to deal with the intractability of combinatorial problems. Recently, a particular structure called (strong) backdoor has been identified in the context of the satisfiability problem. Connections has been established between backdoors and problem hardness leading to a better approximation of the worst case ti...
متن کاملCrowdsourcing Backdoor Identification for Combinatorial Optimization
We will show how human computation insights can be key to identifying so-called backdoor variables in combinatorial optimization problems. Backdoor variables can be used to obtain dramatic speedups in combinatorial search. Our approach leverages the complementary strength of human input, based on a visual identification of problem structure, crowdsourcing, and the power of combinatorial solvers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2021
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2021.04.105